翻訳と辞書 Words near each other ・ Halimi Abd Manaf ・ Halimi Family Order of Kedah ・ Halimione ・ Halimione portulacoides ・ Halimium ・ Halimium lasianthum ・ Halimium ocymoides ・ Halimochirurgus ・ Halimococcidae ・ Halimodendron ・ Halimolobos ・ Halimolobos jaegeri ・ Halimornis ・ Halimzai ・ Halin ・ Halin graph ・ Halin Taungbo ・ Halin's grid theorem ・ Halina ・ Halina Abramczyk ・ Halina Aszkiełowicz-Wojno ・ Halina Auderska ・ Halina Balon ・ Halina Bashlakova ・ Halina Biegun ・ Halina Bielińska ・ Halina Birenbaum ・ Halina Buyno-Łoza ・ Halina Czerny-Stefańska ・ Halina Czerny-Stefańska in memoriam International Piano Competition Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Halin graph ： ウィキペディア英語版 Halin graph In graph theory, a Halin graph is a type of planar graph. It is constructed from a tree that has at least four vertices, none of which have exactly two neighbors. The tree is drawn in the plane so none of its edges cross; then edges are added that connect all its leaves into a cycle.〔''Encyclopaedia of Mathematics'', first Supplementary volume, 1988, ISBN 0-7923-4709-9, p. 281, article ("Halin Graph" ), and references therein.〕 Halin graphs are named after German mathematician Rudolf Halin, who studied them in 1971,〔.〕 but the cubic Halin graphs had already been studied over a century earlier by Kirkman.〔 == Construction == A Halin graph is constructed as follows. Let $T$ be a tree with more than three vertices, such that no vertex of $T$ has degree two (that is, no vertex has exactly two neighbors), embedded in the plane. Then a Halin graph is constructed by adding to $T$ a cycle through each of its leaves, such that the augmented graph remains planar. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Halin graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.